ToricQuiver ^ List -- taking a subquiver by indexing

Operator: ^
Usage:

Q^L
Inputs:
- Q, a toric quiver,
- L, a list, of integers specifying which arrows to subset
Outputs:
- S, a toric quiver, the subquiver in question

Description

This method returns a the subquiver of the quiver Q that is made up of the arrows in the list L.

i1 : Q = bipartiteQuiver(2, 3);

i2 : SQ = Q^{0,1,3}

o2 = ToricQuiver{flow => {1, 1, 0, 1, 0, 0}                            }
                 IncidenceMatrix => | -1 -1 -1 0  0  0  |
                                    | 0  0  0  -1 -1 -1 |
                                    | 1  0  0  1  0  0  |
                                    | 0  1  0  0  1  0  |
                                    | 0  0  1  0  0  1  |
                 Q0 => {0, 1, 2, 3, 4}
                 Q1 => {{0, 2}, {0, 3}, {0, 4}, {1, 2}, {1, 3}, {1, 4}}
                 weights => {-2, -1, 2, 1, 0}

o2 : ToricQuiver

Ways to use this method:

ToricQuiver ^ List -- taking a subquiver by indexing

The source of this document is in /build/macaulay2-88fgJW/macaulay2-1.25.11+ds/M2/Macaulay2/packages/ThinSincereQuivers.m2:3279:0.

ToricQuiver ^ List -- taking a subquiver by indexing

Description

See also

Ways to use this method: